A Survey of Octree Volume Rendering Methods
نویسنده
چکیده
Octrees are attractive data structures for rendering of volumes, as they provide simultaneously uniform and hierarchical data encapsulation. They have been successfully applied to compression, simplification, and extraction as well as rendering itself. This paper surveys and compares existing works employing octrees for volume rendering. It focuses specifically on extraction, direct volume rendering, and isosurface ray tracing.
منابع مشابه
Binary Volumetric Octree Representation for Image-Based Rendering
A Binary Volumetric Octree (BVO) is a volume array with binary opacity voxels, represented as octree. The BVO structure allows to stores not the complete object volume, but only the surface voxels. The new approach to Image Based Rendering (IBR), using this representation, makes it possible to use single data structure for fast, occlusion-compatible hierarchical warping, splattingbased renderin...
متن کاملRendering by Template - Based
We present a new volume rendering algorithm using raycasting and texture mapping formulations for parallel projection in this paper. The volume is represented and stored in an eecient octree data structure. The octree blocks are adaptively chosen to minimize unnecessary processing of empty voxels. The algorithm exploits the uniform shape, orientation and size of the octree blocks by building te...
متن کاملA Lipschitz Method for Accelerated
Interpolating discrete volume data into a continuous form adapts implicit surface techniques for rendering volumetric iso-surfaces. One such algorithm uses the Lipschitz condition to create an octree representation that accelerates volume rendering. Furthermore, only one preprocessing step is needed to create the Lipschitz-octree representation that accelerates rendering of iso-surfaces for any...
متن کاملAn Octree-based Multiresolution Approach Supporting Interactive Rendering of Very Large Volume Data Sets
We present an octree-based approach supporting multiresolution volume rendering of large data sets. Given a set of scattered points without connectivity information, we impose an octree data structure of low resolution in the preprocessing step. The construction of this initial octree structure is controlled by the original data resolution and cell-speci c error values. Using the octree nodes, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006